Global Disclosure Risk Measures and k-Anonymity Property for Microdata
نویسندگان
چکیده
In today’s world, governmental, public, and private institutions systematically release data which describes individual entities (commonly referred as microdata). Those institutions are increasingly concerned with possible misuses of the data that might lead to disclosure of confidential information. Moreover, confidentiality regulation requires that privacy of individuals represented in the released data must be protected. To protect the identity of individual entities from the microdata a large number of disclosure control methods have been proposed in the literature (such as sampling, simulation, data swapping, microaggregation, etc.). To compare different approaches to achieve data protection, various disclosure risk measures have been proposed in the literature. We introduced in our earlier papers a customized global disclosure risk measure that varied between a minimal and maximal value. In the mean time, Samarati and Sweeney have introduced a property, called k-anonymity, which must be satisfied by a microdata to guarantee the protection of individual entities [Samarati 2001, Sweeney 2002a]. In this paper we describe our disclosure risk measures, the k-anonymity property, and then we compare their advantages and disadvantages. The global disclosure risk measures offer more information about the level of protection and they can be customized based on the specific privacy requirements for a given microdata. On the other end, k-anonymity property can be obtained automatically with efficient algorithms, while the usage of the global disclosure risk measures still involves human intervention.
منابع مشابه
Generating Microdata with P -Sensitive K -Anonymity Property
Existing privacy regulations together with large amounts of available data have created a huge interest in data privacy research. A main research direction is built around the k-anonymity property. Several shortcomings of the k-anonymity model have been fixed by new privacy models such as p-sensitive k-anonymity, l-diversity, (α, k)-anonymity, and t-closeness. In this paper we introduce the Enh...
متن کاملAn approximate microaggregation approach for microdata protection
Microdata protection is a hot topic in the field of Statistical Disclosure Control, which has gained special interest after the disclosure of 658000 queries by the America Online (AOL) search engine in August 2006. Many algorithms, methods and properties have been proposed to deal with microdata disclosure. One of the emerging concepts in microdata protection is k-anonymity, introduced by Samar...
متن کاملk-Anonymous Microdata Release via Post Randomisation Method
The problem of the release of anonymized microdata is an important topic in the fields of statistical disclosure control (SDC) and privacy preserving data publishing (PPDP), and yet it remains sufficiently unsolved. In these research fields, k-anonymity has been widely studied as an anonymity notion for mainly deterministic anonymization algorithms, and some probabilistic relaxations have been ...
متن کاملAvoiding Attribute Disclosure with the (Extended) p-Sensitive k-Anonymity Model
Existing privacy regulations together with large amounts of available data created a huge interest in data privacy research. A main research direction is built around the k-anonymity property. Several shortcomings of the k-anonymity model were addressed by new privacy models such as p-sensitive k-anonymity, l-diversity, (α,k)-anonymity, t-closeness. In this chapter we describe two algorithms (G...
متن کاملBeyond Multivariate Microaggregation for Large Record Anonymization
Microaggregation is one of the most commonly employed microdata protection methods. The basic idea of microaggregation is to anonymize data by aggregating original records into small groups of at least k elements and, therefore, preserving k-anonymity. Usually, in order to avoid information loss, when records are large, i.e., the number of attributes of the data set is large, this data set is s...
متن کامل